On sums of coefficients of Borwein type polynomials over arithmetic progressions

نویسندگان

چکیده

We obtain asymptotic formulas for sums over arithmetic progressions of coefficients polynomials the form $$ \prod _{j=1}^n\prod _{k=1}^{p-1}(1-q^{pj-k})^s, where p is an odd prime and n, s are positive integers. Precisely, let $$a_i$$ denote coefficient $$q^i$$ in above polynomial suppose that b integer. prove \Big |\sum _{i\equiv b\ \mathrm{mod}\ 2pn}a_i-\frac{v(b)p^{sn}}{2pn}\Big |\le p^{sn/2},$$ $$v(b)=p-1$$ if divisible by $$v(b)=-1$$ otherwise. This improves a recent result Goswami Pantangi (Ramanujan J, 2021. https://doi.org/10.1007/s11139-020-00352-0 ).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounding sums of the Möbius function over arithmetic progressions

Let M(x) = ∑ 1≤n≤x μ(n) where μ is the Möbius function. It is well-known that the Riemann Hypothesis is equivalent to the assertion that M(x) = O(x1/2+ ) for all > 0. There has been much interest and progress in further bounding M(x) under the assumption of the Riemann Hypothesis. In 2009, Soundararajan established the current best bound of M(x) √ x exp ( (log x)(log log x) ) (setting c to 14, ...

متن کامل

Sums of the Thue–Morse sequence over arithmetic progressions

In this note we use the theory of Boolean functions to find a new elementary proof for Moser’s conjecture that states that in the bounded sequence of nonnegative integers divisible by 3 there are more integers with an even number of 1s in their base-2 representation. This proof is simpler than the original proof by D. J. Newman in 1969. We further apply the method to prove a similar result for ...

متن کامل

Discrepancy of Sums of Three Arithmetic Progressions

The set system of all arithmetic progressions on [n] is known to have a discrepancy of order n1/4. We investigate the discrepancy for the set system S3 n formed by all sums of three arithmetic progressions on [n] and show that the discrepancy of S3 n is bounded below by Ω(n1/2). Thus S3 n is one of the few explicit examples of systems with polynomially many sets and a discrepancy this high.

متن کامل

Discrepancy of Sums of two Arithmetic Progressions

Estimating the discrepancy of the hypergraph of all arithmetic progressions in the set [N ] = {1, 2, . . . , N} was one of the famous open problems in combinatorial discrepancy theory for a long time. An extension of this classical hypergraph is the hypergraph of sums of k (k ≥ 1 fixed) arithmetic progressions. The hyperedges of this hypergraph are of the form A1 + A2 + . . . + Ak in [N ], wher...

متن کامل

on direct sums of baer modules

the notion of baer modules was defined recently

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Ramanujan Journal

سال: 2021

ISSN: ['1572-9303', '1382-4090']

DOI: https://doi.org/10.1007/s11139-021-00512-w